Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

Authors

  • rahmat arab Industrial Engineering Department, Tehran University
Abstract:

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous vehicles with specific capacities through a direct delivery strategy. Additionally, storage capacities are considered limited and the shortage is assumed to be impermissible. To validate this new bi-objective model, the ε-constraint method is used for solving problems. The ε-constraint method is an exact method for solving multi-objective problems, which offers Pareto's solutions, such as meta-heuristic algorithms. Since problems without distribution planning are very complex to solve optimally, the problem considered in this paper also belongs to a class of NP-hard ones. Therefore, a non-dominated sorting genetic algorithm (NSGA-II) as a well-known multi-objective evolutionary algorithm is used and developed to solve a number of test problems. In this paper, 20 sample problems with the e-constraint method and NSGA-II are solved and compared in different dimensions based on Pareto's solutions and the time of resolution. Furthermore, the computational results showed the better performance of the NSGA-II.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

An Adapted Non-dominated Sorting Algorithm (ANSA) for Solving Multi Objective Trip Distribution Problem

Trip distribution deals with estimation of trips distributed among origins and destinations and is one of the important stages in transportation planning. Since in the real world, trip distribution models often have more than one objective, multi-objective models are developed to cope with a set of conflict goals in this area. In a proposed method of adapted non-dominated sorting algorithm (ANS...

full text

A New Multi-Objective Inventory-Routing Problem by an Imperialist Competitive Algorithm

One of the most important points in a supply chain is customer-driven modeling, which reduces the bullwhip effect in the supply chain, as well as the costs of investment on the inventory and efficient transshipment of the products. Their homogeneity is reflected in the inventory-routing problem, which is a combination of distribution and inventory management. This paper considers a multi object...

full text

solution of security constrained unit commitment problem by a new multi-objective optimization method

چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...

A New Non-dominated Sorting Genetic Algorithm for Multi-Objective Optimization 85 A New Non-dominated Sorting Genetic Algorithm for Multi-Objective Optimization

Multi-objective optimization (MO) is a highly demanding research topic because many realworld optimization problems consist of contradictory criteria or objectives. Considering these competing objectives concurrently, a multi-objective optimization problem (MOP) can be formulated as finding the best possible solutions that satisfy these objectives under different tradeoff situations. A family o...

full text

a dynamic multi-objective rail-car fleet sizing problem solved by non-dominated sorting genetic algorithm-ii

the aim of this paper is to present an efficient method for a rail freight car fleet sizing problem. this problem is modeled mathematically as a multi-period, dynamic and multi-objective, in which the rail freight wagons are assumed to be heterogeneous. demands for different wagons and all travel times are assumed deterministic. in order to increase the utilization of the available wagons in th...

full text

Multi-objective optimization of discrete time–cost tradeoff problem in project networks using non-dominated sorting genetic algorithm

The time–cost tradeoff problem is one of the most important and applicable problems in project scheduling area. There are many factors that force the mangers to crash the time. This factor could be early utilization, early commissioning and operation, improving the project cash flow, avoiding unfavorable weather conditions, compensating the delays, and so on. Since there is a need to allocate e...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 31  issue 4

pages  588- 596

publication date 2018-04-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023